Rectangle packing with one-dimensional resource augmentation
نویسندگان
چکیده
منابع مشابه
Two-dimensional bin packing with one-dimensional resource augmentation
The 2-dimensional Bin Packing problem is a generalization of the classical Bin Packing problems and is defined as follows: Given a collection of rectangles specified by their width and height, the goal is to pack these into minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions requires a large num...
متن کاملOnline Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an algorithm were given the entire input in advance, it could give an optimal solution (in exponential time). Instead of giving the algorithm more knowledge about the input, in this paper we consider the effects of giving...
متن کاملApproximation of Two-Dimensional Rectangle Packing
1-d bin packing and 2-d bin packing are classic NP-complete problems that are motivated by industrial applications of stock cutting, data storage, etc. In this paper, we look at a slightly more general problem that is primarily motivated by VLSI design. In VLSI design, one wants to pack a given number of rectangles (which might be RAM chips, transistors, etc.) into a wafer of minimum area to re...
متن کاملOn Packing Squares with Resource Augmentation: Maximizing the Profit
We consider the problem of packing squares with profits into a bounded square region so as to maximize their total profit. More specifically, given a set L of n squares with positive profits, it is required to pack a subset of them into a unit size square region [0;1℄ [0;1℄ so that the total profit of the squares packed is maximized. For any given positive accuracy ε > 0, we present an algorith...
متن کاملOptimal rectangle packing
We consider the NP-complete problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. We present two different constraintsatisfaction formulations of this problem. The first searches a space of absolute placements of rectangles in the enclosing rectangle, while the other searches a space of relative placements between pairs of rectangles. Both appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.04.001